package algorithm.test1Tree.test7RedBlackTree;

public class RBTree<E> extends BST<E>{
    private static final boolean REA=false;
    private static final boolean BLACK=true;
    /*public RBTree(){
        super(null);
    }
    public RBTree(Comparator<E> comparator){
        super(comparator);
    }

    *//**
     * 染色
     * @param node
     * @param color
     *//*
    private Node<E> color(Node<E> node,boolean color){
        if(node==null){
            return;
        }
        ((RBNode<E>)node).color=color;
        return node;
    }


    private static class RBNode<E> extends Node<E>{

        boolean color;
        public RBNode(E element,Node<E> parent){
            super(element,parent);
        }
    }*/
}
